- context-sensitive construction
- Лингвистика: контекстозависимая конструкция
Универсальный англо-русский словарь. Академик.ру. 2011.
context-sensitive construction
Смотреть что такое "context-sensitive construction" в других словарях:
Context Sensitive Solutions — (CSS) is a theoretical and practical approach to transportation decision making and design that takes into consideration the communities and lands which streets, roads, and highways pass through ( the context ). The term is closely related to but … Wikipedia
Context-sensitive solutions (transport) — Context sensitive solutions (CSS) is a theoretical and practical approach to transportation decision making and design that takes into consideration the communities and lands which streets, roads, and highways pass through ( the context ). The… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
building construction — Techniques and industry involved in the assembly and erection of structures. Early humans built primarily for shelter, using simple methods. Building materials came from the land, and fabrication was dictated by the limits of the materials and… … Universalium
Questionnaire construction — A questionnaire is a series of questions asked to individuals to obtain statistically useful information about a given topic [ Merriam Webster s Online Dictionary , s.v. questionnaire, http://www.merriam webster.com/dictionary/questionnaire… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Nested word — In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of… … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Frame Technology (software engineering) — Frame Technology is a language neutral, models to code system that manufactures custom software [Software is emphasized here; but given the appropriate frames, FT can assemble any kind of documents: technical and end user manuals, UML models,… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Graftal — A graftal or L system is a formal grammar used in computer graphics to recursively define branching tree and plant shapes in a compact format. The shape is defined by a string of symbols constructed by a graftal grammar. A graftal grammar… … Wikipedia
